On decomposing a hypergraph into k connected sub-hypergraphs

نویسندگان

  • András Frank
  • Tamás Király
  • Matthias Kriesell
چکیده

By applying the matroid partition theorem of J. Edmonds [1] to a hypergraphic generalization of graphic matroids, due to M. Lorea [3], we obtain a generalization of Tutte’s disjoint trees theorem for hypergraphs. As a corollary, we prove for positive integers k and q that every (kq)-edge-connected hypergraph of rank q can be decomposed into k connected sub-hypergraphs, a well-known result for q = 2. Another by-product is a connectivity-type sufficient condition for the existence of k edge-disjoint Steiner trees in a bipartite graph.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph

In this paper, we study the problem of finding all connected and Berge-acyclic sub-hypergraphs contained in an input hypergraph with potential applications to substructure mining from relational data, where Berge acyclicity is a generalization of a tree and one of the most retricted notion of acyclicity for hypergraphs (Fagin, J. ACM, Vol.30(3), pp.514–550, 1983). As main results, we present ef...

متن کامل

Edge-connectivity of permutation hypergraphs

In this note we provide a generalization of a result of Goddard, Raines and Slater [4] on edge-connectivity of permutation graphs for hypergraphs. A permutation hypergraph Gπ is obtained from a hypergraph G by taking two disjoint copies of G and by adding a perfect matching between them. The main tool in the proof of the graph result was the theorem on partition constrained splitting off preser...

متن کامل

Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles

Using the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph, we continue the investigation of the existence of a decomposition of the complete 3-uniform hypergraph into Hamiltonian cycles began by Bailey and Stevens. We also discuss two extensions of the problem: to the complete 3-uniform hypergraph from which a parallel class of triples has been removed, and to the com...

متن کامل

Monomial Ideals, Edge Ideals of Hypergraphs, and Their Minimal Graded Free Resolutions

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph H appears within the resolution of its edge ideal I(H). We discuss when recursive formulas to compute the graded Betti numbers of I(H) in terms of its sub...

متن کامل

Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs

We consider the following definition of connectedness in k-uniform hypergraphs: two j-sets (sets of j vertices) are j-connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. The hypergraph is jconnected if all j-sets are pairwise j-connected. We determine the threshold at which the random k-uniform hypergraph with edge probability p b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 131  شماره 

صفحات  -

تاریخ انتشار 2003